A Knowledge Management Scheme for Meta-Data: An Information Structure Graph
نویسنده
چکیده
For an effective management of data, we need various kinds of meta-data knowledge such as what they mean; how they are created; how they are organized, etc. Some of them are managed as a database schema; others are not. This article proposes a scheme an Information Structure Graph (ISG) to represent these kinds of meta-data that are not managed as a database schema. An Information Structure Graph describes structures that data are created or derived from other data. It is a directed graph, where nodes represent data objects and arcs connect nodes. That is, it is built on a database schema and extends it to include data creation structures. An ISG can be used to answer following questions about data; which data are comparable to each other? If some data includes wrong values, what impacts does it have on other data items? How long does it take to update a data item after something has happened in a real world?
منابع مشابه
LPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملMaximal Independent Sets for the Pixel Expansion of Graph Access Structure
Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...
متن کاملMAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE
Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...
متن کاملThe Effective Factors on Employee Engagement and Healthcare Knowledge Management in the Organization: Meta-Analysis of Studies
Background and Aim: Knowledge management and employee engagement are the key factors for organizations to achieve competitive advantage, increase productivity and improve performance. The purpose of this study was to identify the relation of effective factors on employee engagement and healthcare knowledge management in the organization. Materials and Methods: This research was applied in ter...
متن کاملA Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Decision Support Systems
دوره 36 شماره
صفحات -
تاریخ انتشار 2001